Percolation threshold, Fisher exponent, and shortest path exponent for four and five dimensions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Percolation threshold, Fisher exponent, and shortest path exponent for four and five dimensions.

We develop a method of constructing percolation clusters that allows us to build very large clusters using very little computer memory by limiting the maximum number of sites for which we maintain state information to a number of the order of the number of sites in the largest chemical shell of the cluster being created. The memory required to grow a cluster of mass s is of the order of s(strai...

متن کامل

A critical exponent for shortest-path scaling in continuum percolation

We carry out Monte Carlo experiments to study the scaling behavior of shortest path lengths in continuum percolation. These studies suggest that the critical exponent governing this scaling is the same for both continuum and lattice percolation. We use splitting, a technique that has not yet been fully exploited in the physics literature, to increase the speed of our simulations. This technique...

متن کامل

Exact critical exponent for the shortest-path scaling function in percolation

It is shown that the critical exponent g1 related to pair-connectiveness and shortestpath (or chemical distance) scaling, recently studied by Porto et al., Dokholyan et al., and Grassberger, can be found exactly in 2d by using a crossing-probability result of Cardy, with the outcome g1 = 25/24. This prediction is consistent with existing simulation results. [Published as J. Phys. A. 32, L457-45...

متن کامل

On the Exponent of the All Pairs Shortest Path Problem

The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, the exponent of the algorithms known for the all pairs shortest path problem has stayed at three all these years even for the very special case of directed graphs with uniform edge lengths. In this paper we give an algor...

متن کامل

One-arm Exponent for Critical 2d Percolation

The probability that the cluster of the origin in critical site percolation on the triangular grid has diameter larger than R is proved to decay like R−5/48 as R→ ∞.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review E

سال: 2001

ISSN: 1063-651X,1095-3787

DOI: 10.1103/physreve.64.026115